/**
 * @a https://www.nowcoder.com/practice/99eb8040d116414ea3296467ce81cbbc
 */
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<long long>> dp(n + 1, vector<long long>(m + 1, 0));
    for (int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= m; ++j)
        {
            long long tmp; cin >> tmp;
            dp[i][j] = tmp + dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1];
        }
    }
    int x1,y1,x2,y2;
    while(q--)
    {
        cin >> x1 >> y1 >> x2 >> y2;
        cout << dp[x2][y2] - dp[x2][y1-1] - dp[x1-1][y2] + dp[x1-1][y1-1] << endl;
    }

    return 0;
}